A NOTE ON THE SYNTACTIC ANALYSIS BY TRANSFORMATIONAL GRAMMARS

Syntactic Analysis for Transformational Grammars by

Transformational Priors Over Grammars

This paper proposes a novel class of PCFG parameterizations that support linguistically reasonable priors over PCFGs. To estimate the parameters is to discover a notion of relatedness among context-free rules such that related rules tend to have related probabilities. The prior favors grammars in which the relationships are simple to describe and have few major exceptions. A basic version that ...

a study on insurer solvency by panel data model: the case of iranian insurance market

the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.

On Restrictions on Transformational Grammars Reducing the Generative Power

Various restrictions on transformational grammars have been investigated in order to reduce their generative power from recursively enumerable languages to recursive languages. It will be shown that any restriction on transformational grammars defining a recursively enumerable subset of the set of all transformational grammars, is either too weak (in the sense that there does not exist a genera...

Syntactic Analysis by Local Grammars Automata: an Efficient Algorithm

The description of the constraints restricting words' combinations in specific contexts provides helpful grammars for reducing the number of ambiguities of lemmatized texts. These grammars allow to easily eliminate many of the ambiguities without even using complex general syntactic rules involving a lexicon-grammar. Local grammars can be represented in a very natural way by finite state automa...